A Comparison of ATM Stream Merging Techniques
نویسندگان
چکیده
Multi-layer forwarding (a.k.a. multi-layer switching or routing) approaches, using ATM as transport technology have proven not to be sufficiently scaleable, if route aggregation is not performed. In ATM networks route aggregation means stream merging, that is cells from different incoming streams to be switched to the same outgoing link using the same stream identifier. This identifier could be either the whole VPI/VCI pair (VC merging) or only the VPI (VP merging). Stream merging approaches are quite often addressed as VC merging approaches and in this paper we follow this naming convention, unless otherwise specified. The standard way of carrying IP over ATM exploits AAL5 as the ATM Adaptation Layer, but AAL5 does not provide the native support for VC merging. On the other hand, AAL3/4 supports VC merging, but it introduces a considerable and unnecessary overhead when it is used to carry connectionless traffic. This paper provides an overview of the VC merging problem and presents a review of the most common approaches proposed so far. It also presents CLIMAX, a solution that could fit in different scenarios to solve the VC merging problem.
منابع مشابه
AAL5X ATM Adaptation Layer 5 eXtension for Efficient VC Merging over ATM Networks
The realization of multiway group communications and scaleable layer 3 switching over ATM networks requires merging of virtual connections to be possible. This capability, known as VC merging, cannot be provided by ATM networks which use a standard ATM protocol stack on both switches and stations. This paper describes AAL5X, an extension to the ATM Adaptation Layer 5 (AAL5) that allows for VC m...
متن کاملThe Dyadic Algorithm for Stream Merging
We study the stream merging problem for media-on-demand servers. Clients requesting media from the server arrive by a Poisson process, and delivery to the clients starts immediately. Clients are prepared to receive up to two streams at any time, one or both being fed into a buffer cache. A multicast mechanism exists that allows multiple clients to receive the same stream. We present an on-line ...
متن کاملEfficient Cost-Based Scheduling for Scalable Media Streaming
The number of media streams that can be supported concurrently is highly constrained by the stringent requirements of real-time playback and high transfer rates. To address this problem, media delivery techniques, such as Batching and Stream Merging, utilize the multicast facility to increase resource sharing. The achieved resource sharing depends greatly on how the waiting requests are schedul...
متن کاملMerging Video Streams in a Multimedia
Due to recent advances in network, storage and data compression technologies, video-on-demand (VOD) service has become economically feasible. It is a challenging task to design a video storage server taht can eeciently service a large number of concurrent requests on-demand. One approach to accomplishing this task is to reduce the I/O demand to the VOD server through data and resource sharing t...
متن کاملProvably Efficient Stream Merging
We investigate the stream merging problem for mediaon-demand servers. Clients requesting media from the server arrive by a Poisson process, and delivery to the clients starts immediately. Clients are prepared to receive up to two streams at any time, one or both being fed into a bu er cache. A multicast mechanism exists that allows multiple clients to receive the same stream. We present an on-l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998